Recognizing Recursive Circulant Graphs G(cd M ; D)
نویسندگان
چکیده
Recursive circulant graphs G(N; d) have been introduced in 1994 by Park and Chwa PC94] as a new topology for interconnection networks. Recursive circulant graphs G(N; d) are circu-lant graphs with N nodes and with jumps of powers of d. A subfamily of recursive circulant graphs (more precisely, G(2 k ; 4)) is of same order and degree than the hypercube of dimension k, with sometimes better parameters, such as diameter PC94, GMR98]. Embeddings among recursive circulant graphs, hypercubes and Knndel graphs of order 2 k have also been studied in PC, FR98b]. Here, following a question raised in CFG99], we give, thanks to a sharp structural analysis of such graphs, an O(cd m+2 (2m) d) algorithm to determine if a given graph is a recursive circulant graph of the form G(cd m ; d), for any d 3, except in the case where c is even while d is odd. Applying this algorithm to recursive circulant graphs G(2 k ; 4) gives us an O(2 k k 4) recognition algorithm for such graphs.
منابع مشابه
Recognizing Recursive
Recursive circulant graphs G(N; d) have been introduced in 1994 by Park and Chwa [PC94] as a new topology for interconnection networks. Recursive circulant graphs G(N; d) are circulant graphs with N nodes and with jumps of powers of d. A subfamily of recursive circulant graphs (more precisely, G(2; 4)) is of same order and degree than the hypercube of dimension k, with sometimes better paramete...
متن کاملHamiltonian decomposition of recursive circulant graphs
The graph G(N; d) has vertex set V = {0; 1; : : : ; N − 1}, with {v; w} an edge if v − w ≡ ±di(modN ) for some 06i6dlogd Ne − 1. We show that the circulant graph G(cd; d) is Hamilton decomposable for all positive integers c; d, and m with c¡d. This extends work of Micheneau and answers a special case of a question of Alspach. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملHamiltonian Decomposition of Recursive
We show that recursive circulant G(cd m ; d) is hamiltonian decomposable. Recursive circulant is a graph proposed for an interconnection structure of multicomputer networks in [8]. The result is not only a partial answer to the problem posed by Alspach that every connected Cayley graph over an abelian group is hamiltonian decomposable, but also an extension of Micheneau's that recursive circula...
متن کاملOn the independent spanning trees of recursive circulant graphs G(cdm, d) with d>2
Two spanning trees of a graph G are said to be independent if they are rooted at the same vertex r, and for each vertex v 6= r in G, the two different paths from v to r, one path in each tree, are internally disjoint. A set of spanning trees of G is independent if they are pairwise independent. A recursive circulant graph G(N, d) has N = cdm vertices labeled from 0 to N − 1, where d > 2, m > 1,...
متن کاملRecognizing Circulant Graphs of Prime Order in Polynomial Time Recognizing Circulant Graphs of Prime Order in Polynomial Time
1 Abstract In this paper we present a time-polynomial recognition algorithm for circulant graphs of prime order. A circulant graph G of order n is a Cayley graph over the cyclic group Z n : Equivalently, G is circulant ii its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a coherent connguration A and, in...
متن کامل